Constrained Thompson Sampling for Real-Time Electricity Pricing With Grid Reliability Constraints
نویسندگان
چکیده
منابع مشابه
Thompson Sampling for Dynamic Pricing
In this paper we apply active learning algorithms for dynamic pricing in a prominent e-commerce website. Dynamic pricing involves changing the price of items on a regular basis, and uses the feedback from the pricing decisions to update prices of the items. Most popular approaches to dynamic pricing use a passive learning approach, where the algorithm uses historical data to learn various param...
متن کاملRethinking Real-Time Electricity Pricing
Most US consumers are charged a near-constant retail price for electricity, despite substantial hourly variation in the wholesale market price. This paper evaluates the rst program to expose residential consumers to hourly real-time pricing (RTP). I nd that enrolled households are statistically signi cantly price elastic and that consumers responded by conserving energy during peak hours, but...
متن کاملOptimising Electricity Real Time Pricing Tariffs
Electricity Real Time Pricing (RTP) tariffs inter alia have Demand Side Management (DSM) as a main aim. Customers are billed according to hourly fluctuating energy prices. Essentially RTP pricing signals can be seen as control inputs to change customer load usage. It is suggested that optimised pricing signals sent to RTP customers can lead to a much more efficient DSM initiative. This paper de...
متن کاملReal Time Pricing and Electricity Markets
Most US consumers are charged a near-constant retail price for electricity, despite substantial hourly variation in the wholesale market price. This paper evaluates a randomized experiment that exposed households to hourly real time pricing (RTP) and applies the demand estimates to counterfactual simulations in a structural model of the Pennsylvania-Jersey-Maryland electricity market. The model...
متن کاملReal-time Path Computation with Reliability Constraints
In this study, we developed algorithms that compute reliability-guaranteed least-cost path(s) between any node pair in a network. These algorithms help carriers to reduce the risk of breaching the service reliability guarantee, and to reduce unnecessary under utilization of their network resource. Simulation results show that our heuristic algorithms achieved very good performance and reduce co...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Smart Grid
سال: 2020
ISSN: 1949-3053,1949-3061
DOI: 10.1109/tsg.2020.3004770